منابع مشابه
Succinct Index for Dynamic Dictionary Matching
In this paper we revisit the dynamic dictionary matching problem, which asks for an index for a set of patterns P1, P2, . . . , Pk that can support the following query and update operations efficiently. Given a query text T , we want to find all the occurrences of of these patterns; furthermore, as the set of patterns may change over time, we also want to insert or delete a pattern. The major c...
متن کاملDynamic 2D Dictionary Matching in Small Space
The dictionary matching problem preprocesses a set of patterns and finds all occurrences of each of the patterns in a text when it is provided. We focus on the dynamic setting, in which patterns can be inserted to and removed from the dictionary, without reprocessing the entire dictionary. This article presents the first algorithm that performs dynamic dictionary matching on two-dimensional dat...
متن کاملA Framework for Dynamic Parameterized Dictionary Matching
Two equal-length strings S and S′ are a parameterized-match (p-match) iff there exists a one-toone function that renames the characters in S to those in S′. Let P be a collection of d patterns of total length n characters that are chosen from an alphabet Σ of cardinality σ. The task is to index P such that we can support the following operations: search(T ): given a text T , report all occurren...
متن کاملEfficient Dynamic Dictionary Matching with DAWGs and AC-automata
The dictionary matching is a task to find all occurrences of pattern strings in a set D (called a dictionary) on a text string T . The Aho-Corasick-automaton (AC-automaton) which is built on D is a fundamental data structure which enables us to solve the dictionary matching problem in O(d log σ) preprocessing time and O(n log σ + occ) matching time, where d is the total length of the patterns i...
متن کاملA New Linear-Time Dynamic Dictionary Matching Algorithm
This research presents inverted lists as a new data structure for the dynamic dictionary matching algorithm. The inverted lists structure, which derives from the inverted index, is implemented by the perfect hashing table. The dictionary is constructed in optimal time and the individual patterns can be updated in minimal time. The searching phase scans the given text in a single pass, even in a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1994
ISSN: 0022-0000
DOI: 10.1016/s0022-0000(05)80047-9